#!usr/bin/env python  
# -*- coding:utf-8 -*-
""" 
@author:robot
@file: title021.py 
@version:
@time: 2023/05/14
https://leetcode.cn/problems/longest-continuous-increasing-subsequence/
"""
from typing import List


class Solution:
    def findLengthOfLCIS(self, nums: List[int]) -> int:
        dp = [1 for i in nums]
        for i in range(1, len(nums)):
            if nums[i] > nums[i - 1]:
                dp[i] = dp[i - 1] + 1
        return max(dp)


print(Solution().findLengthOfLCIS([1, 3, 5, 4, 7]))
